A Biclustering Method for Gene Expression Module Discovery Using a Closed Itemset Enumeration Algorithm
نویسندگان
چکیده
منابع مشابه
biclustering algorithm for embryonic tumor gene expression dataset: las algorithm
an important step in considering of gene expression data is obtained groups of genes that have similarity patterns. biclustering methods was recently introduced for discovering subsets of genes that have coherent values across a subset of conditions. the las algorithm relies on a heuristic randomized search to find biclusters. in this paper, we introduce biclustering las algorithm and then appl...
متن کاملBiclustering of Gene Expression Data using a Two - Phase Method
Biclustering is a very useful data mining technique which identifies coherent patterns from microarray gene expression data. A bicluster of a gene expression dataset is a subset of genes which exhibit similar expression patterns along a subset of conditions. Biclustering is a powerful analytical tool for the biologist and has generated considerable interest over the past few decades. Many biclu...
متن کاملGene expression module discovery using gibbs sampling.
Recent advances in high throughput profiling of gene expression have catalyzed an explosive growth in functional genomics aimed at the elucidation of genes that are differentially expressed in various tissue or cell types across a range of experimental conditions. These studies can lead to the identification of diagnostic genes, classification of genes into functional categories, association of...
متن کاملAdaptation Knowledge Discovery for Cooking Using Closed Itemset Extraction
This paper is about the adaptation knowledge (AK) discovery for the Taaable system, a case-based reasoning system that adapts cooking recipes to user constraints. The AK comes from the interpretation of closed itemsets (CIs) whose items correspond to the ingredients that have to be removed, kept, or added. An original approach is proposed for building the context on which CI extraction is perfo...
متن کاملA New Algorithm for High Average-utility Itemset Mining
High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2007
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.3.183